Data Storage Optimization Model Based on Improved Simulated Annealing Algorithm

نویسندگان

چکیده

Since there is a longitudinal and horizontal penetration problem between multi-level data centers in the smart grid information transmission network. Based on improved Simulated Annealing algorithm, this paper proposes storage optimization model for grids based Hadoop architecture. Combining characteristics of distributed cloud computing, are equivalent to task-oriented set. The platform flattened, equal collection multiple centers. over time were counted derive dependencies task sets sets. According dependency sets, mathematical was established combination with actual power grid. optimal correspondence each set center calculated. An algorithm solves When generating new solution, Grey Wolf provides direction finding solution. This integrated existing business computational resources establish affiliation distribution calculated, optimally stored physical disk. Arithmetic examples used analyze efficiency stability several algorithms verify algorithm’s advantages, algorithms’ effectiveness confirmed by simulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Kinoform Optimization Algorithm Based on Simulated Annealing

Computer Generated Holography (CGH) [7] is a technique which generate a hologram by using computers. The CGH can be used in many applications, such as optical interconnection, optical information, optical elements and so on. The great advantage of the CGH is that it can be generate a hologram of virtual objects. The kinoform [6], one of the CGHs, is an attractive device that can manage wave fro...

متن کامل

An Improved Nested Partitions Algorithm Based on Simulated Annealing in Complex Decision Problem Optimization

This paper introduces the main ideas of the nested partitions (NP) method, analyses its efficiency theoretically and proposes the way to improve the optimization efficiency of the algorithm. Then the paper introduces the simulated annealing (SA) algorithm and incorporates the ideas of SA into two of the arithmetic operators of NP algorithm to form the combined NP/SA algorithm. Moreover, the pap...

متن کامل

An Improved Algorithm for 3D NoC Floorplanning Based on Particle Swarm Optimization of Nesting Simulated Annealing

In this paper, an improved floorplanning algorithm, named the floorplanning algorithm based on particle swarm optimization algorithm nesting simulated annealing to optimize the floorplans (PSO-SA-NoC), has been proposed with simulations conducted to verify this algorithm. The simulation results are compared with the original Simulated Annealing-NoC. The results show that the CPU’s process time ...

متن کامل

A SVM Image Segmentation Algorithm Based on Improved Simulated Annealing Particle Swarm Optimization

Extracting the user interested foreground from the image with intensity inhomogeneity and complex backgrounds is an important issue in image segmentation. The features of the complex background image and the user interested foreground image can be extracted respectively. Then we can use the machine learning theory to segment the image. The traditional learning classification methods include art...

متن کامل

portfolio optimization with simulated annealing algorithm

the markowitz issue of optimization can’t be solved by precise mathematical methods such as second order schematization, when real world condition and limitations are considered. on the other hand, most managers prefer to manage a small portfolio of available assets in place of a huge portfolio. it can be analogized to cardinal constrains, that is, constrains related to minimum and maximum curr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sustainability

سال: 2023

ISSN: ['2071-1050']

DOI: https://doi.org/10.3390/su15097388